Mechanised Refinement of Procedures

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Mechanised Refinement of Procedures

Refine is a tool that supports the application of Morgan’s refinement calculus. It was designed to support teaching and use by beginners; it is already in use. We describe here the extension of Refine to support the development of (possibly recursive) procedures in the algebraic style of the refinement calculus already adopted by Refine. Resumo. Refine é uma ferramenta que suporta a aplicação d...

متن کامل

Learning Strategies for Mechanised Building of Decision Procedures

In this paper we present an investigation into whether and how decision procedures can be learnt and built automatically. Our approach consists of two stages. First, a refined brute-force search procedure applies exhaustively a set of given elementary methods to try to solve a corpus of conjectures generated by a stochastic context-free grammar. The successful proof traces are saved. In the sec...

متن کامل

Procedures and Atomicity Refinement

We deene a return statement for procedures in an action systems framework and show that it corresponds to carrying out an atomicity reenement. Hence, the introduction of an early return from a (remote) procedure call can increase the degree of parallelism in a parallel or distributed algorithm modelled by an action system.

متن کامل

An Integration of Mechanised Reasoning

Mechanised reasoning systems and computer algebra systems have apparently di erent objectives. Their integration is, however, highly desirable, since in many formal proofs both of the two di erent tasks, proving and calculating, have to be performed. Even more importantly, proof and computation are often interwoven and not easily separable. In the context of producing reliable proofs, the quest...

متن کامل

Mechanised Separation Algebra

We present an Isabelle/HOL library with a generic type class implementation of separation algebra, develop basic separation logic concepts on top of it, and implement generic automated tactic support that can be used directly for any instantiation of the library. We show that the library is usable by multiple example instantiations that include common as well as more exotic base structures such...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Electronic Notes in Theoretical Computer Science

سال: 2007

ISSN: 1571-0661

DOI: 10.1016/j.entcs.2007.03.015